Mingling: mixed-integer rounding with bounds
نویسندگان
چکیده
منابع مشابه
Mingling: mixed-integer rounding with bounds
Mixed-integer rounding (MIR) is a simple, yet powerful procedure for generating valid inequalities for mixed-integer programs. When used as cutting planes, MIR inequalities are very effective for mixed-integer programming problems with unbounded integer variables. For problems with bounded integer variables, however, cutting planes based on lifting techniques appear to be more effective. This i...
متن کاملConic mixed-integer rounding cuts
A conic integer program is an integer programming problem with conic constraints.Manyproblems infinance, engineering, statistical learning, andprobabilistic optimization aremodeled using conic constraints. Herewe studymixed-integer sets definedby second-order conic constraints.We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second...
متن کاملGeneralized Mixed Integer Rounding Valid Inequalities
We present new families of valid inequalities for (mixed) integer programming (MIP) problems. These valid inequalities are based on a generalization of the 2-step mixed integer rounding (MIR), proposed by Dash and Günlük (2006). We prove that for any positive integer n, n facets of a certain (n + 1)-dimensional mixed integer set can be obtained through a process which includes n consecutive app...
متن کامل9839 AGGREGATION and MIXED INTEGER ROUNDING toSOLVE
A separation heuristic for mixed integer programs is presented that theoretically allows one to derive several families of \strong" valid inequalities for speciic models and computationally gives results as good as or better than those obtained from several existing separation routines including ow cover and integer cover inequalities. The heuristic is based on aggregation of constraints of the...
متن کاملMixed Integer Rounding Cuts and Master Group Polyhedra
We survey recent research on mixed-integer rounding (MIR) inequalities and a generalization, namely the two-step MIR inequalities defined by Dash and Günlük (2006). We discuss the master cyclic group polyhedron of Gomory (1969) and discuss how other subadditive inequalities, similar to MIR inequalities, can be derived from this polyhedron. Recent numerical experiments have shed much light on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2009
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-009-0265-x